class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
dic1 = {}
dic2 ={}
for i in range(len(ransomNote)):
if ransomNote[i] in dic1:
dic1[ransomNote[i]] +=1
else:
dic1[ransomNote[i]] = 1
for i in range(len(magazine)):
if magazine[i] in dic2:
dic2[magazine[i]] +=1
else:
dic2[magazine[i]] = 1
for i in dic1:
if i in dic2:
if dic1[i]<=dic2[i]:
continue
else:
return False
else:
return False
return True
1506A - Strange Table | 456A - Laptops |
855B - Marvolo Gaunt's Ring | 1454A - Special Permutation |
1359A - Berland Poker | 459A - Pashmak and Garden |
1327B - Princesses and Princes | 1450F - The Struggling Contestant |
1399B - Gifts Fixing | 1138A - Sushi for Two |
982C - Cut 'em all | 931A - Friends Meeting |
1594A - Consecutive Sum Riddle | 1466A - Bovine Dilemma |
454A - Little Pony and Crystal Mine | 2A - Winner |
1622B - Berland Music | 1139B - Chocolates |
1371A - Magical Sticks | 1253A - Single Push |
706B - Interesting drink | 1265A - Beautiful String |
214A - System of Equations | 287A - IQ Test |
1108A - Two distinct points | 1064A - Make a triangle |
1245C - Constanze's Machine | 1005A - Tanya and Stairways |
1663F - In Every Generation | 1108B - Divisors of Two Integers |